首页> 外文OA文献 >Supervised multiview learning based on simultaneous learning of multiview intact and single view classifier
【2h】

Supervised multiview learning based on simultaneous learning of multiview intact and single view classifier

机译:基于同步学习的监督多视图学习   多视图完整和单视图分类器

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Multiview learning problem refers to the problem of learning a classifierfrom multiple view data. In this data set, each data points is presented bymultiple different views. In this paper, we propose a novel method for thisproblem. This method is based on two assumptions. The first assumption is thateach data point has an intact feature vector, and each view is obtained by alinear transformation from the intact vector. The second assumption is that theintact vectors are discriminative, and in the intact space, we have a linearclassifier to separate the positive class from the negative class. We define anintact vector for each data point, and a view-conditional transformation matrixfor each view, and propose to reconstruct the multiple view feature vectors bythe product of the corresponding intact vectors and transformation matrices.Moreover, we also propose a linear classifier in the intact space, and learn itjointly with the intact vectors. The learning problem is modeled by aminimization problem, and the objective function is composed of a Cauchy errorestimator-based view-conditional reconstruction term over all data points andviews, and a classification error term measured by hinge loss over all theintact vectors of all the data points. Some regularization terms are alsoimposed to different variables in the objective function. The minimizationproblem is solve by an iterative algorithm using alternate optimizationstrategy and gradient descent algorithm. The proposed algorithm shows itadvantage in the compression to other multiview learning algorithms onbenchmark data sets.
机译:多视图学习问题是指从多个视图数据中学习分类器的问题。在此数据集中,每个数据点由多个不同的视图表示。在本文中,我们提出了一种解决该问题的新方法。该方法基于两个假设。第一个假设是每个数据点都具有完整的特征向量,并且通过从完整向量进行线性变换来获得每个视图。第二个假设是完整矢量是有区别的,并且在完整空间中,我们有一个线性分类器将正类和负类分开。我们为每个数据点定义一个完整的向量,并为每个视图定义一个视图条件转换矩阵,并提出通过将相应的完整向量与变换矩阵乘积来重构多个视图特征向量的方法。此外,我们还提出了一个完整的线性分类器空间,并与完整的向量一起学习。学习问题是通过最小化问题来建模的,目标函数由所有数据点和视图上基于柯西误差估计器的视图条件重构项以及所有数据点的所有完整矢量上的铰链损耗所度量的分类误差项组成。一些正则化项也被施加到目标函数中的不同变量。最小化问题通过使用交替优化策略和梯度下降算法的迭代算法解决。所提出的算法在基准数据集上比其他多视图学习算法具有更大的压缩优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号